The Window Distribution of Multiple TCPs with Random Loss Queues
نویسندگان
چکیده
Two approximate techniques for analyzing the window size distribution of TCP flows sharing a RED-like bottleneck queue are presented. Both methods presented first use a fixed point algorithm to obtain the mean window sizes of the flows, and the mean queue length in the bottleneck buffer. The simpler of the two methods then uses the ‘square root formula’ for TCP; the other method is more complicated. More often than not, the simpler method is slightly more accurate; this is probably due to the fact that window sizes of the different flows are negatively correlated. Keywords—TCP, multiple, distribution, RED, queues.
منابع مشابه
Longest Path in Networks of Queues in the Steady-State
Due to the importance of longest path analysis in networks of queues, we develop an analytical method for computing the steady-state distribution function of longest path in acyclic networks of queues. We assume the network consists of a number of queuing systems and each one has either one or infinite servers. The distribution function of service time is assumed to be exponential or Erlang. Fu...
متن کاملABSTRACT Title of Dissertation: DYNAMICS of TCP CONGESTION AVOIDANCE with RANDOM DROP and RANDOM MARKING QUEUES
Title of Dissertation: DYNAMICS of TCP CONGESTION AVOIDANCE with RANDOM DROP and RANDOM MARKING QUEUES Archan Misra, Doctor of Philosophy, 2000 Directed by: Professor John S. Baras, Department of Electrical and Computer Engineering Development and deployment of newer congestion feedback measures such as RED and ECN provides us a signi cant opportunity for modifying TCP response to congestion. E...
متن کاملSOME GENERALIZATIONS OF WEAK CONVERGENCE RESULTS ON MULTIPLE CHANNEL QUEUES IN HEAVY TRAFFIC.
This paper extends certain results of Iglehart and Whitt on multiple channel queues to the case where the inter-arrival times and service times are not necessarily identically distributed. It is shown that the weak convergence results in this case are exactly the same as those obtained by Iglehart and Whitt
متن کاملThe Interaction Between Window Adjustment Strategies and Queue Management Schemes
In this paper, we investigate extensively the joint network dynamics with different AIMD window-adjustment parameters on end-hosts, and different queue management schemes (i.e. DropTail vs. RED) in routers. We reveal that with DropTail buffer, although smooth TCPs causes less queuing-delay jitter, its average queuing delay is significantly higher than that of responsive TCPs. The direct implica...
متن کاملMulti Objective Optimization Placement of DG Problem for Different Load Levels on Distribution Systems with Purpose Reduction Loss, Cost and Improving Voltage Profile Based on DAPSO Algorithm
Along with economic growth of countries which leads to their increased energy requirements,the problem of power quality and reliability of the networks have been more considered andin recent decades, we witnessed a noticeable growing trend of distributed generation sources(DG) in distribution networks. Occurrence of DG in distribution systems, in addition tochanging the utilization of these sys...
متن کامل